Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics
نویسندگان
چکیده
Recently, the stage and cf2 semantics for abstract argumentation attracted specific attention. By distancing from the notion of defense, they are capable to select arguments out of odd-length cycles. Furthermore, the maximality criterion of naive sets ensures reasonable solutions. The SCCrecursive schema, where the cf2 semantics is defined in, guarantees that some specific evaluation criteria, like directionality, weakand CF-reinstatement, are fulfilled. Beside several desirable properties, both stage and cf2 semantics still have some drawbacks. The stage semantics does not satisfy the above mentioned evaluation criteria, whereas cf2 semantics produces some questionable results on frameworks with cycles of length≥ 6. That’s why we suggest to combine stage semantics with the SCC-recursive schema of cf2 semantics. The resulting stage2 semantics overcomes the problems regarding cf2 semantics and still fulfills the mentioned evaluation criteria. Furthermore, we analyze redundant patterns for stage2 semantics, and we provide a complexity analysis of the associated reasoning problems.
منابع مشابه
Stage semantics and the SCC-recursive schema for argumentation semantics
Recently, stage and cf2 semantics for abstract argumentation attracted specific attention. By distancing from the notion of defense, they are capable to select arguments out of odd-length cycles. In case of cf2 semantics, the SCC-recursive schema guarantees that important evaluation criteria for argumentation semantics, like directionality, weakand CF -reinstatement, are fulfilled. Beside sever...
متن کاملA recursive approach to argumentation: motivation and perspectives
In the context of Dung’s argumentation framework, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected components of the argumentation framework. We introduce the fundamental notion of SCCrecursiveness and show that all Dung’s admissibilitybased semantics are SCC-recursive, and therefore a special case of our schema. The space of...
متن کاملA General Recursive Schema for Argumentation Semantics
In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics has been introduced to solve the problems related to counterintuitive results produced by literature proposals. In this semantics, an important role is played by a recursive schema in the definition of extensions. This paper pro...
متن کاملA SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation
This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific “base ...
متن کاملAn SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation
This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific “base ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012